The Syntactic Monoid of an Infix Code
نویسندگان
چکیده
Necessary and sufficient conditions on a monoid M are found in order that M be isomorphic to the syntactic monoid of a language L over an alphabet X having one of the following properties. In the first theorem L is a /¿-class and Pw¡¡\ Q PL where PL is the syntactic congruence of L and W(L) is the residue of L . In the second theorem L is an infix code; that is, satisfies u, uvw 6 L implying u = w = I . In the third theorem L is an infix code satisfying a condition which amounts to the requirement that M be a nilmonoid. Various refinements of these conditions are also considered.
منابع مشابه
Topologies for the Set of
An infinite sequence (!-word) is referred to as disjunctive provided it contains every finite word as infix (factor). As Jürgensen and Thierrin [JT83] observed the set of disjunctive !-words, D, has a trivial syntactic monoid but is not accepted by a finite automaton. In this paper we derive some topological properties of the set of disjunctive!-words. We introduce two non-standard topologies o...
متن کاملInfix Congruences on a Free Monoid
A congruence p on a free monoid X* is said to be infix if each class C of p satisfies u e C and xuy € C imply xy = 1 . The main purpose of this paper is a characterization of commutative maximal infix congruences. These turn out to be congruences induced by homomorphisms t from X* to N° , the monoid of nonnegative integers under addition, with T"1(0) = 1.
متن کاملSemisimplicity of the Algebra Associated to a Biprefix Code
{. INTRODUCTION There exists a canonical way to associate to each language (that is, to each subset of a free monoid) an algebra on a ~iven field; we call it its syntactic algebra. This construction is in fact a particular case of a more general one that applies to formal power series in non commutative variables similar to the construction of the syntactic monoid of a language. In this paper w...
متن کاملOn syntactic groups
We prove that for any finite prefix code X with n elements, the non special subgroups in the syntactic monoid of X have degree at most n − 1. This implies in particular that the groups in the syntactic monoid of X are all cyclic when X is a prefix code with three elements.
متن کاملOn syntactic monoids of biunitary submonoids determined by homomorphisms from free semigroups onto completely simple semigroups
We deal with the maximal bifix code construction which is a natural generalization of a group code construction. For a surjective morphism from a free monoidA∗ onto a completely simple semigroup with an adjoined identityM(G; I, J ; )1 and a submonoid S of M(G; I, J ; )1, under certain conditions, the base of a submonoid −1(S) is a maximal bifix code X. We investigate the relationships between t...
متن کامل